The natural algorithmic approach of mixed trigonometric-polynomial problems

The aim of this paper is to present a new algorithm for proving mixed trigonometric-polynomial inequalities of the form [Formula: see text] by reducing them to polynomial inequalities. Finally, we show the great applicability of this algorithm and, as an example, we use it to analyze some new rational (Padé) approximations of the function cos2x and to improve a class of inequalities by Yang. The results of our analysis could be implemented by means of an automated proof assistant, so our work is a contribution to the library of automatic support tools for proving various analytic inequalities.